Running Head: DISTRIBUTED ESTIMATION OF GRAPH EDGE-TYPE WEIGHTS
نویسندگان
چکیده
We describe a distributed structural estimation approach for recovering graph edge-type weights that are revealed through orders generated by a specific type of influence propagation, Edge-Type Weighted PageRank. Our implementation combines numerical gradient descent with PageRank iterations using the Pregel framework.
منابع مشابه
An exact algorithm for the Steiner 2-edge-survivable network problem
A graph G is 2-edge-connected if between every pair of nodes of G, there are at least two edge-disjoint paths. If positive weights are associated with the edges of G and if T is a set of distinguished nodes of G, then the Steiner 2edge-survivable subgraph problem consists in finding a minimum weight 2-edgeconnected subgraph of G spanning T . This problem has applications to the design of reliab...
متن کاملDirected Single–Source Shortest–Paths in Linear Average–Case Time
The quest for a linear-time single-source shortest-path (SSSP) algorithm on directed graphs with positive edge weights is an ongoing hot research topic. While Thorup recently found an O(n +m) time RAM algorithm for undirected graphs with n nodes, m edges and integer edge weights in f0; : : : ; 2w 1g where w denotes the word length, the currently best time bound for directed sparse graphs on a R...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملDistributed Edge Partitioning for Graph Processing
The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased. Appropriately partitioning the graph as a preprocessing step can improve the degree of parallelism of its analysis. A ...
متن کاملScalable Mutual Information Estimation using Dependence Graphs
We propose a unified method for empirical non-parametric estimation of general Mutual Information (MI) func-tion between the random vectors in R based on N i.i.d. samples.The proposed low complexity estimator is based on a bipartitegraph, referred to as dependence graph. The data points aremapped to the vertices of this graph using randomized LocalitySensitive Hashing (L...
متن کامل